A BASELINE MODEL FOR SCHEDULING SOFT REAL TIME TASKS ON UNI-PROCESSOR SYSTEMS

Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling

Preemptively Scheduling Hard-Real-Time Sporadic Tasks on One Processor

In this paper, we consider the preemptive scheduling of hard-real-time sporadic task systems on one processor. We rst give necessary and su cient conditions for a sporadic task system to be feasible (i.e., schedulable). The conditions cannot, in general, be tested e ciently (unless P =NP). They do, however, lead to a feasibility test that runs in e cient pseudo-polynomial time for a very large ...

A Real-Time Scheduling Algorithm for Soft Periodic Tasks

Since now, some scheduling algorithms have been presented to guarantee the time constraints of soft real-time tasks, but most of them have some drawbacks. The first drawback of them is that scheduling decisions are based on parameters which are assumed to be crisp; however, in many environments the values of these parameters are uncertain. The second one is the high time complexity of these met...

A Fuzzy Algorithm for Scheduling Periodic Tasks on Multiprocessor Soft Real-Time Systems

In this paper we consider the use of fuzzy logic in the scheduling of periodic tasks in soft real-time multiprocessor systems. Most researches concerning real-time system scheduling assumes scheduling constraint to be precise. However, in many circumstances the values of these parameters are vague. The vagueness of parameters suggests that we make use of fuzzy logic to decide in what order the ...

Real-Time Workload Allocation on a Uni-Processor

The paper presents a novel allocation algorithm to allocate independent real time tasks on a processor in a way that improves the processor's throughput (Processor's throughput is the number of tasks the processor can accept for execution). The proposed approach allocates tasks' workloads (task's workload is the percentage of work required by the processor to execute the tas...